Nonsmooth analysis and approximation
نویسندگان
چکیده
منابع مشابه
fragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولSimultaneous perturbation stochastic approximation of nonsmooth functions
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This model enables us to use the approximation of the objective function by twice differentiable functions and to present their gradients by volume integrals. The calculus of the stochastic gradient by means of this present...
متن کاملNonsmooth Analysis and Parametric Optimization
In an optimization problem that depends on parameters, an important issue is the effect that perturbations of the parameters can have on solutions to the problem and their associated multipliers. Under quite broad conditions the possibly multi-valued mapping that gives these elements in terms of the parameters turns out to enjoy a property of " proto-differentiability. " Generalized derivatives...
متن کاملNonsmooth analysis of eigenvalues
The eigenvalues of a symmetric matrix depend on the matrix nons-moothly. This paper describes the nonsmooth analysis of these eigen-values. In particular, I present a simple formula for the approximate (limiting Fr echet) subdiierential of an arbitrary function of the eigen-values, subsuming earlier results on convex and Clarke subgradients. As an example I compute the subdiierential of the k't...
متن کاملParallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization
Consider the problem of minimizing the sum of a smooth (possibly non-convex) and a convex (possibly nonsmooth) function involving a large number of variables. A popular approach to solve this problem is the block coordinate descent (BCD) method whereby at each iteration only one variable block is updated while the remaining variables are held fixed. With the recent advances in the developments ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1988
ISSN: 0021-9045
DOI: 10.1016/0021-9045(88)90037-8